When Hashes Collide
نویسندگان
چکیده
attitude is dangerous: crypto provides the foundation for any real attempt at security or privacy. Without it, we couldn’t build truly secure solutions for the challenges of information confidentiality and integrity or individual user authentication and authorization; we also wouldn’t be able to deal with more complicated concepts such as signing digital documents or enabling nonrepudiation for electronic messages or contracts. Cryptography isn’t in the public eye very often, but when it is, the news can be disconcerting. For the inaugural installment of this new department, we’ll discuss the issues that have arisen around the recently announced problems with the SHA-1 hash function and its ancestor, MD5.
منابع مشابه
#h00t: Censorship Resistant Microblogging
Microblogging services such as Twitter are an increasingly important way to communicate, both for individuals and for groups through the use of hashtags that denote topics of conversation. However, groups can be easily blocked from communicating through blocking of posts with the given hashtags. We propose #h00t, a system for censorship resistant microblogging. #h00t presents an interface that ...
متن کاملKeynote: Role of Image Processing, Navigation and Robots in Image-guided Intervention
Locality-sensitive hashing has been applied in several problems in bioinformatics to quickly search large sequences by examining the n-grams of the sequences. We observe in these application a bias in the random generation of hashes and define an effective equivalence for hashes that generate nearly identical results. Methods that address these two points demonstrate an improvement to the rate ...
متن کاملHash-Based File Content Identification Using Distributed Systems
A serious problem in digital forensics is handling very large amounts of data. Since forensic investigators often have to analyze several terabytes of data within a single case, efficient and effective tools for automatic data identification or filtering are very important. A commonly used data identification technique is using the cryptographic hash of a file and match it against white and bla...
متن کاملThe Power of Asymmetry in Binary Hashing
When approximating binary similarity using the hamming distance between short binary hashes, we show that even if the similarity is symmetric, we can have shorter and more accurate hashes by using two distinct code maps. I.e. by approximating the similarity between x and x′ as the hamming distance between f(x) and g(x′), for two distinct binary codes f, g, rather than as the hamming distance be...
متن کاملSound and complete computational interpretation of symbolic hashes in the standard model
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known Abadi-Rogaway logic with probabilistic hashes and give a precise semantic interpretation to it using Canetti’s oracle hashes. These are probabilistic polynomialtime hashes that hide all partial information. Finally, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Security & Privacy
دوره 3 شماره
صفحات -
تاریخ انتشار 2005